Effective Supervisor Synthesis for Automated Manufacturing Systems Based on Finite State Automata
نویسندگان
چکیده
منابع مشابه
Deadlock Avoidance Policies for Automated Manufacturing Systems Using Finite State Automata
This chapter considers the problem of deadlock avoidance in flexibly automated manufacturing systems, one of the most prevalent supervisory control problems that challenges the effective deployment of these environments. The problem is addressed through the modeling abstraction of the (sequential) resource allocation system (RAS), and the pursued analysis uses concepts and results from the form...
متن کاملSynthesis of fault-tolerant supervisor for automated manufacturing systems: a case study on photolithographic process
In this paper, a discrete event dynamic system (DEDS) approach is utilized to improve the reliability of a system from the faulttolerance viewpoint. We propose a systematic way to classify faults and failures quantitatively and to find tolerable fault event sequences embedded in DEDS’s. After this, the synthesis of a fault-tolerant supervisory control system is investigated. A case study of a p...
متن کاملControl Synthesis of Discrete Manufacturing Systems using Timed Finite Automata
An application of timed game automaton to the control synthesis of discrete manufacturing systems is presented in the paper. This approach adopts the algorithm for optimal control synthesis of timed automata proposed in [1] as a game-theoretic approach between controller and the model of the plant. KeyWords: Timed automata, control synthesis, model verification, production systems.
متن کاملSupervisor Synthesis of POMDP based on Automata Learning
As a general and thus popular model for autonomous systems, partially observable Markov decision process (POMDP) can capture uncertainties from different sources like sensing noises, actuation errors, and uncertain environments. However, its comprehensiveness makes the planning and control in POMDP difficult. Traditional POMDP planning problems target to find the optimal policy to maximize the ...
متن کاملTools for Fast Morphological Analysis Based on Finite State Automata
The paper presents a new implementation of some of Jan Daciuk’s algorithms and tools for morphological analysis based on finite state automata [1]. In particular, we offer a reimplemented version of the tool which builds the automata from an input set of strings and of the tool which performs the morphological analysis itself. In addition to 8bit versions we also offer “Unicode-aware” versions ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Automation and Smart Technology
سال: 2018
ISSN: 2223-9766
DOI: 10.5875/ausmt.v8i2.1698